Sparsity Preserving Discretization With Error Bounds
نویسندگان
چکیده
منابع مشابه
Topology preserving data simplification with error bounds
Many approaches to simpliication of triangulated terrains and surfaces have been proposed which permit bounds on the error introduced. A few algorithms additionally bound errors in auxiliary functions deened over the triangulation. We present an approach to simpliication of scalar elds over unstructured grids which preserves the topology of functions deened over the triangulation, in addition t...
متن کاملScene Simpli®cation TOPOLOGY PRESERVING DATA SIMPLIFICATION WITH ERROR BOUNDS
ÐMany approaches to simpli®cation of triangulated terrains and surfaces have been proposed which permit bounds on the error introduced. A few algorithms additionally bound errors in auxiliary functions de®ned over the triangulation. We present an approach to simpli®cation of scalar ®elds over unstructured grids which preserves the topology of functions de®ned over the triangulation, in addition...
متن کاملOptimal A Priori Discretization Error Bounds for Geodesic Finite Elements
We prove optimal bounds for the discretization error of geodesic finite elements for variational partial differential equations for functions that map into a nonlinear space. For this we first generalize the well-known Céa lemma to nonlinear function spaces. In a second step we prove optimal interpolation error estimates for pointwise interpolation by geodesic finite elements of arbitrary order...
متن کاملRegularization and discretization error estimates for optimal control of ODEs with group sparsity
It is well known that optimal control problems with L1-control costs produce sparse solutions, i.e., the optimal control is zero on whole intervals. In this paper, we study a general class of convex linear-quadratic optimal control problems with a sparsity functional that promotes a so-called group sparsity structure of the optimal controls. In this case, the components of the control function ...
متن کاملSparsity Preserving Projections
Dimensionality reduction methods (DRs) have commonly been used as a principled way to understand the high-dimensional data such as face images. In this paper, we propose a new unsupervised DR method called Sparsity Preserving Projections (SPP). Unlike many existing techniques such as Local Preserving Projection (LPP) and Neighborhood Preserving Embedding (NPE), where local neighborhood informat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2020.12.1085